OR-parallel execution of Prolog on a multi-sequential machine
نویسندگان
چکیده
منابع مشابه
Or-Parallel Prolog Execution on Clusters of Multicores
Logic Programming languages, such as Prolog, provide an excellent framework for the parallel execution of logic programs. In particular, the inherent non-determinism in the way logic programs are structured makes Prolog very attractive for the exploitation of implicit parallelism. One of the most noticeable sources of implicit parallelism in Prolog programs is or-parallelism. Or-parallelism ari...
متن کاملPALS: Efficient Or-Parallel execution of Prolog on Beowulf clusters
This paper describes the development of the PALS system, an implementation of Prolog capable of efficiently exploiting or-parallelism on distributed-memory platforms— specifically Beowulf clusters. PALS makes use of a novel technique, called incremental stack-splitting. The technique proposed builds on the stack-splitting approach, previously described by the authors and experimentally validate...
متن کاملAn Or-Parallel Prolog Execution Model for Clusters of Multicores
Logic Programming languages, such as Prolog, offer a great potential for the exploitation of implicit parallelism. One of the most distinguishable sources of implicit parallelism in Prolog programs is orparallelism. Or-parallelism arises from the simultaneous evaluation of a subgoal call against the clauses that match that call. Arguably, or-parallel Prolog systems based on the environment copy...
متن کاملOn Comparing Alternative Splitting Strategies for Or-Parallel Prolog Execution on Multicores
Many or-parallel Prolog models exploiting implicit parallelism have been proposed in the past. Arguably, one of the most successful models is environment copying for shared memory architectures. With the increasing availability and popularity of multicore architectures, it makes sense to recover the body of knowledge there is in this area and re-engineer prior computational models to evaluate t...
متن کاملImplementing Prolog Extensions: a Parallel Inference Machine
We present in this paper a general inference machine for building a large class of meta-interpreters. In particular, this machine is suitable for implementing extensions of Prolog with non-classical logics. We give the description of the abstract machine model and an implementation of this machine in a fast language (ADA), along with a discussion on why and how parallelism can easily increase s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Parallel Programming
سال: 1986
ISSN: 0885-7458,1573-7640
DOI: 10.1007/bf01414554